Fundamental Limits of Caching: Improved Bounds For Small Buffer Users
نویسنده
چکیده
In this work, the peak rate of the caching problem is investigated, under the scenario that the users are with small buffer sizes and the number of users is no less than the amount of files in the server. A novel coded caching strategy is proposed for such a scenario, leading to a lower peak rate compared to recent results in the literature. Furthermore, it is verified that our peak rates coincides with the cut-set bound analytically in an information-theoretic view. Index Terms Caching, coded caching, content distribution, network coding
منابع مشابه
Optimal Error Correcting Delivery Scheme for an Optimal Coded Caching Scheme with Small Buffers
Optimal delivery scheme for coded caching problems with small buffer sizes and the number of users no less than the amount of files in the server was proposed by Chen, Fan and Letaief [“Fundamental limits of caching: improved bounds for users with small buffers," IET Communications, 2016]. This scheme is referred to as the CFL scheme. In this paper, the link between the server and the users is ...
متن کاملFundamental Limits of Caching: Improved Bounds with Coded Prefetching
We consider a cache network in which a single server is connected to multiple users via a shared error free link. The server has access to a database with N files of equal length F , and serves K users each with a cache memory of MF bits. A novel centralized coded caching scheme is proposed for scenarios with more users than files N ≤ K and cache capacities satisfying 1 K ≤ M ≤ N K . The propos...
متن کاملA Note on the Fundamental Limits of Coded Caching
The fundamental limit of coded caching is investigated for the case with N = 3 files and K = 3 users. An improved outer bound is obtained through the computational approach developed by the author in an earlier work. This result is part of the online collection of “Solutions of Computed Information Theoretic Limits (SCITL)”.
متن کاملCloud and Cache-Aided Wireless Networks: Fundamental Latency Trade-Offs
A cloud and cache-aided wireless network architecture is studied in which edge-nodes (ENs), such as base stations, are connected to a cloud processor via dedicated fronthaul links, while also being endowed with caches. Cloud processing enables the centralized implementation of cooperative transmission strategies at the ENs, albeit at the cost of an increased latency due to fronthaul transfer. I...
متن کاملFundamental Limits on Delivery Time in Cloud- and Cache-Aided Heterogeneous Networks
A Fog radio access network (F-RAN) is considered as a network architecture candidate to meet the soaring demand in terms of reliability, spectral efficiency, and latency in next generation wireless networks. This architecture combines the benefits associated with centralized cloud processing and wireless edge caching enabling primarily low-latency transmission under moderate fronthaul capacity ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1407.1935 شماره
صفحات -
تاریخ انتشار 2014